Partial order semantics and read arcs
نویسندگان
چکیده
منابع مشابه
Partial Order Semantics and Read Arcs
We study a new partial order semantics of Petri nets with read arcs, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled in ordinary nets. As basic observations we take ST-traces, which are sequences of transition starts and ends. We deene processes of our nets and derive two partial orders modelling causality and start pr...
متن کاملDomain and event structure semantics for Petri nets with read and inhibitor arcs
We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work by Winskel on safe (ordinary) nets, the truly concurrent semantics is given at a categorical level via a chain of coreflections leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime alg...
متن کاملFunctorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs
We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work of Winskel on safe nets, the truly concurrent semantics is given at a categorical level via a chain of functors leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains. ...
متن کاملPartial Order Semantics of Types of Nets
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the synthesis of Petri nets from (step) transition systems. Partial order semantics of a concrete net (of a certain type) usually are given by the set of labelled partial orders (LPOs) enabled w.r.t. the net. For classical p...
متن کاملVerification of Petri Nets with Read Arcs
Recent work studied the unfolding construction for contextual nets, i.e. nets with read arcs. Such unfoldings are more concise and can usually be constructed more efficiently than for Petri nets. However, concrete verification algorithms exploiting these advantages were lacking so far. We address this question and propose SAT-based verification algorithms for deadlock and reachability of contex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00234-1